Computational complexity theory

Results: 2049



#Item
181COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla  Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res

COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-01-17 04:55:28
182Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith  J. Christopher Beck

Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck

Add to Reading List

Source URL: www.haz.ca

Language: English - Date: 2013-10-28 07:18:32
183Verification of Markov Decision Processes using Learning Algorithms? Tom´asˇ Br´azdil1 , Krishnendu Chatterjee2 , Martin Chmel´ık2 , Vojtˇech Forejt3 , Jan Kˇret´ınsk´y2 , Marta Kwiatkowska3 , David Parker4 , a

Verification of Markov Decision Processes using Learning Algorithms? Tom´asˇ Br´azdil1 , Krishnendu Chatterjee2 , Martin Chmel´ık2 , Vojtˇech Forejt3 , Jan Kˇret´ınsk´y2 , Marta Kwiatkowska3 , David Parker4 , a

Add to Reading List

Source URL: www.hieratic.eu

Language: English
184J. Cryptol: 116–135 DOI: s00145x Parallel Repetition of Computationally Sound Protocols Revisited∗ Krzysztof Pietrzak

J. Cryptol: 116–135 DOI: s00145x Parallel Repetition of Computationally Sound Protocols Revisited∗ Krzysztof Pietrzak

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2012-05-30 09:00:34
185The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-cler

The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-cler

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2009-11-10 10:55:46
186Variationally Universal Hashing Ted Krovetz a and Phillip Rogaway b,c a Department of Computer Science, California State University Sacramento CAUSA

Variationally Universal Hashing Ted Krovetz a and Phillip Rogaway b,c a Department of Computer Science, California State University Sacramento CAUSA

Add to Reading List

Source URL: web.cs.ucdavis.edu

Language: English - Date: 2008-07-02 16:14:32
187Comput. complex), 1 – 010001–20 $ 1.50c Birkh¨ 
 auser Verlag, Basel 1999

Comput. complex), 1 – 010001–20 $ 1.50c Birkh¨ auser Verlag, Basel 1999

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2006-11-08 13:10:36
188Session T2C THE CONCEPT OF “ALGORITHM EFFICIENCY” IN THE HIGH SCHOOL CS CURRICULUM Judith Gal-Ezer 1 and Ela Zur2 Abstract  Algorithms and the efficiency of algorithms are basic concepts to every computer science

Session T2C THE CONCEPT OF “ALGORITHM EFFICIENCY” IN THE HIGH SCHOOL CS CURRICULUM Judith Gal-Ezer 1 and Ela Zur2 Abstract  Algorithms and the efficiency of algorithms are basic concepts to every computer science

Add to Reading List

Source URL: www.openu.ac.il

Language: English - Date: 2009-03-16 13:52:35
189ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

Add to Reading List

Source URL: www.crypto.ethz.ch

Language: English - Date: 2015-07-07 05:51:55
190Exotlst_details_4_21_04.xls

Exotlst_details_4_21_04.xls

Add to Reading List

Source URL: www.esd.ornl.gov

Language: English - Date: 2004-05-26 15:21:32